Serializability, Concurrency Control, and Replication Control
نویسنده
چکیده
Transaction management comprises diierent aspects such as concurrency control, recovery control, and replication control. Usually, only one or at least two of these aspects are considered in theories of transaction management|the other aspects are ignored. In this paper, we propose a model of executions that allows to capture all three aspects of transaction management. Based on this execution model, we present a deenition of serializability. Then, we show how the requirement of serializability can be decomposed into requirements that can be attributed to concurrency control, to replication control, and to recovery control, respectively. Altogether, we obtain a uniied theory of transaction management, where we focus on concurrency control and replication control in this paper.
منابع مشابه
Scalable database replication through dynamic multiversioning
We scale the database back-end in dynamic content cluster servers by distributing read-only transactions on a set of lightweight database replicas while maintaining 1copy-serializability. This is contrary to conventional wisdom in replicated databases which says that one could have either 1-copy serializability or scalability, but not both. The key to scaling is a novel integrated fine-grained ...
متن کاملSHAFT: Serializable, Highly Available and Fault Tolerant Concurrency Control in the Cloud
Guaranteeing transaction semantics in a highly available and fault tolerant manner is desirable to application developers. Besides, it is a very valuable feature for database-backed applications. SHAFT is a pessimistic concurrency control protocol for partitioned and replicated data, which can be distributed across multiple datacenters. Laying its basis on the Paxos algorithm, the SHAFT protoco...
متن کاملConcurrency Control Protocol for Broadcast-based Transaction Processing and Correctness Proof
Observing that it is impractical to use traditional methods to control concurrency for transaction processing in broadcast-based asymmetric communication environment, this paper introduces a concurrency control protocol designed for broadcast-based transaction processing called STUBcast (Server Timestamp and Update Broadcast Supported Concurrency). It then focuses on the correctness proof of ST...
متن کاملQuasi Serializability: a Correctness Criterion for Global Concurrency Control in InterBase
In this paper, we introduce Quasi Serializability, a correctness criterion for concurrency control in heterogeneous distributed database environments. A global history is quasi serializable if it is (conflict) equivalent to a quasi serial history in which global transactions are submitted serially. Quasi serializability theory is an extension of serializability. We study the relationships betwe...
متن کاملSTUBcast - efficient support for concurrency control in broadcast-based asymmetric communication environment
Observing that it is impractical to use traditional methods to control concurrency in broadcast-based asymmetric communication environment, we introduce a concurrency control protocol designed for broadcast-based transaction processing called STUBcast (Server Timestamp and Update Broadcast Supported Concurrency). STUBcast supports two new correctness criteria proposed in this paper Single Seria...
متن کامل